Computational models of interval timing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational models of interval timing

In recent years great progress has been made in the computational modeling of interval timing. A wide range of models capturing different aspects of interval timing now exist. These models can be seen as constituting four, sometimes overlapping, general classes of models: pacemaker– accumulator models, multiple–oscillator models, memory– trace models, and drift–diffusion (or random-process) mod...

متن کامل

Neurocomputational Models of Interval and Pattern Timing.

Most of the computations and tasks performed by the brain require the ability to tell time, and process and generate temporal patterns. Thus, there is a diverse set of neural mechanisms in place to allow the brain to tell time across a wide range of scales: from interaural delays on the order of microseconds to circadian rhythms and beyond. Temporal processing is most sophisticated on the scale...

متن کامل

Good Timing for Computational Models of Narrative Discourse

The temporal order in which story events are presented in discourse can greatly impact how readers experience narrative; however, it remains unclear how narrative systems can leverage temporal order to affect comprehension and experience. We define structural properties of discourse which provide a basis for computational narratologists to reason about good timing, such as when readers learn ab...

متن کامل

Neuromimetic model of interval timing

Neuromimetic models of time processing mechanisms in the sub-second to minute range are mainly focussed on the mean and variance properties of time estimation (scalarity) but offer no appropriate account of attention manipulations: a systematic underestimation of time with decreasing levels of attention. Our model is able to reproduce the scalarity and attentional effects, and fits both behavio...

متن کامل

Fixed interval scheduling: Models, applications, computational complexity and algorithms

The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs to be processed and their assignment to the processing intervals such that the intervals on the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Current Opinion in Behavioral Sciences

سال: 2016

ISSN: 2352-1546

DOI: 10.1016/j.cobeha.2016.01.004